0.02/0.09 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.02/0.09 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 240 THM 0.08/0.29 % Computer : n023.cluster.edu 0.08/0.29 % Model : x86_64 x86_64 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.08/0.29 % Memory : 8042.1875MB 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64 0.08/0.29 % CPULimit : 1920 0.08/0.29 % WCLimit : 240 0.08/0.29 % DateTime : Wed Jul 30 06:29:19 EDT 2025 0.08/0.29 % CPUTime : 0.14/0.39 Running higher-order theorem proving 0.14/0.42 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=240 /export/starexec/sandbox2/tmp/tmp.E1tOv0fNYA/E---3.1_9373.p 0.14/0.46 # Version: 3.0.0-ho 0.14/0.46 # Preprocessing class: HSLMSMSSLLLCHSA. 0.14/0.46 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.46 # Starting lpo1_fix with 720s (3) cores 0.14/0.46 # Starting full_lambda_9 with 240s (1) cores 0.14/0.46 # Starting almost_fo_4 with 240s (1) cores 0.14/0.46 # Starting new_ho_9 with 240s (1) cores 0.14/0.46 # Starting pre_casc_4 with 240s (1) cores 0.14/0.46 # Starting ho_unfolding_6 with 240s (1) cores 0.14/0.46 # pre_casc_4 with pid 9455 completed with status 0 0.14/0.46 # Result found by pre_casc_4 0.14/0.46 # Preprocessing class: HSLMSMSSLLLCHSA. 0.14/0.46 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.46 # Starting lpo1_fix with 720s (3) cores 0.14/0.46 # Starting full_lambda_9 with 240s (1) cores 0.14/0.46 # Starting almost_fo_4 with 240s (1) cores 0.14/0.46 # Starting new_ho_9 with 240s (1) cores 0.14/0.46 # Starting pre_casc_4 with 240s (1) cores 0.14/0.46 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.14/0.46 # Search class: HGUSM-FFMM31-DHSMMSBN 0.14/0.46 # partial match(3): HGHSM-FFMM31-SHSSMSBN 0.14/0.46 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.14/0.46 # Starting new_ho_10 with 130s (1) cores 0.14/0.46 # new_ho_10 with pid 9457 completed with status 0 0.14/0.46 # Result found by new_ho_10 0.14/0.46 # Preprocessing class: HSLMSMSSLLLCHSA. 0.14/0.46 # Scheduled 6 strats onto 8 cores with 240 seconds (1920 total) 0.14/0.46 # Starting lpo1_fix with 720s (3) cores 0.14/0.46 # Starting full_lambda_9 with 240s (1) cores 0.14/0.46 # Starting almost_fo_4 with 240s (1) cores 0.14/0.46 # Starting new_ho_9 with 240s (1) cores 0.14/0.46 # Starting pre_casc_4 with 240s (1) cores 0.14/0.46 # SinE strategy is GSinE(CountFormulas,,true,1.5,0,3,20000,1.0,true) 0.14/0.46 # Search class: HGUSM-FFMM31-DHSMMSBN 0.14/0.46 # partial match(3): HGHSM-FFMM31-SHSSMSBN 0.14/0.46 # Scheduled 6 strats onto 1 cores with 240 seconds (240 total) 0.14/0.46 # Starting new_ho_10 with 130s (1) cores 0.14/0.46 # Preprocessing time : 0.005 s 0.14/0.46 # Presaturation interreduction done 0.14/0.46 0.14/0.46 # Proof found! 0.14/0.46 # SZS status Theorem 0.14/0.46 # SZS output start CNFRefutation 0.14/0.46 thf(decl_23, type, is_of: $i > ($i > $o) > $o). 0.14/0.46 thf(decl_24, type, all_of: ($i > $o) > ($i > $o) > $o). 0.14/0.46 thf(decl_26, type, in: $i > $i > $o). 0.14/0.46 thf(decl_48, type, ordsucc: $i > $i). 0.14/0.46 thf(decl_78, type, e_is: $i > $i > $i > $o). 0.14/0.46 thf(decl_124, type, nat: $i). 0.14/0.46 thf(decl_125, type, n_is: $i > $i > $o). 0.14/0.46 thf(decl_131, type, n_1: $i). 0.14/0.46 thf(decl_143, type, n_pl: $i > $i > $i). 0.14/0.46 thf(decl_144, type, esk1_0: $i). 0.14/0.46 thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox2/tmp/tmp.E1tOv0fNYA/E---3.1_9373.p', def_all_of)). 0.14/0.46 thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox2/tmp/tmp.E1tOv0fNYA/E---3.1_9373.p', def_is_of)). 0.14/0.46 thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox2/tmp/tmp.E1tOv0fNYA/E---3.1_9373.p', def_e_is)). 0.14/0.46 thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox2/tmp/tmp.E1tOv0fNYA/E---3.1_9373.p', def_n_is)). 0.14/0.46 thf(satz4e, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ (ordsucc @ X1) @ (n_pl @ X1 @ n_1))))), file('/export/starexec/sandbox2/tmp/tmp.E1tOv0fNYA/E---3.1_9373.p', satz4e)). 0.14/0.46 thf(satz4a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((n_is @ (n_pl @ X1 @ n_1) @ (ordsucc @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.E1tOv0fNYA/E---3.1_9373.p', satz4a)). 0.14/0.46 thf(c_0_6, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])). 0.14/0.46 thf(c_0_7, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])). 0.14/0.46 thf(c_0_8, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])). 0.14/0.46 thf(c_0_9, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_6, c_0_7])). 0.14/0.46 thf(c_0_10, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_8])). 0.14/0.46 thf(c_0_11, negated_conjecture, ~(![X277:$i]:(((in @ X277 @ nat)=>((ordsucc @ X277)=(n_pl @ X277 @ n_1))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz4e])]), c_0_9]), c_0_10])). 0.14/0.46 thf(c_0_12, plain, ![X282:$i]:(((in @ X282 @ nat)=>((n_pl @ X282 @ n_1)=(ordsucc @ X282)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz4a]), c_0_9]), c_0_10])). 0.14/0.46 thf(c_0_13, negated_conjecture, ((in @ esk1_0 @ nat)&((ordsucc @ esk1_0)!=(n_pl @ esk1_0 @ n_1))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])])). 0.14/0.46 thf(c_0_14, plain, ![X343:$i]:((~(in @ X343 @ nat)|((n_pl @ X343 @ n_1)=(ordsucc @ X343)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])). 0.14/0.46 thf(c_0_15, negated_conjecture, ((ordsucc @ esk1_0)!=(n_pl @ esk1_0 @ n_1)), inference(split_conjunct,[status(thm)],[c_0_13])). 0.14/0.46 thf(c_0_16, plain, ![X1:$i]:((((n_pl @ X1 @ n_1)=(ordsucc @ X1))|~((in @ X1 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_14])). 0.14/0.46 thf(c_0_17, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_13])). 0.14/0.46 thf(c_0_18, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15, c_0_16]), c_0_17])]), ['proof']). 0.14/0.46 # SZS output end CNFRefutation 0.14/0.46 # Parsed axioms : 311 0.14/0.46 # Removed by relevancy pruning/SinE : 244 0.14/0.46 # Initial clauses : 106 0.14/0.46 # Removed in clause preprocessing : 3 0.14/0.46 # Initial clauses in saturation : 103 0.14/0.46 # Processed clauses : 114 0.14/0.46 # ...of these trivial : 4 0.14/0.46 # ...subsumed : 4 0.14/0.46 # ...remaining for further processing : 106 0.14/0.46 # Other redundant clauses eliminated : 1 0.14/0.46 # Clauses deleted for lack of memory : 0 0.14/0.46 # Backward-subsumed : 0 0.14/0.46 # Backward-rewritten : 0 0.14/0.46 # Generated clauses : 4 0.14/0.46 # ...of the previous two non-redundant : 2 0.14/0.46 # ...aggressively subsumed : 0 0.14/0.46 # Contextual simplify-reflections : 0 0.14/0.46 # Paramodulations : 3 0.14/0.46 # Factorizations : 0 0.14/0.46 # NegExts : 0 0.14/0.46 # Equation resolutions : 1 0.14/0.46 # Disequality decompositions : 0 0.14/0.46 # Total rewrite steps : 16 0.14/0.46 # ...of those cached : 5 0.14/0.46 # Propositional unsat checks : 0 0.14/0.46 # Propositional check models : 0 0.14/0.46 # Propositional check unsatisfiable : 0 0.14/0.46 # Propositional clauses : 0 0.14/0.46 # Propositional clauses after purity: 0 0.14/0.46 # Propositional unsat core size : 0 0.14/0.46 # Propositional preprocessing time : 0.000 0.14/0.46 # Propositional encoding time : 0.000 0.14/0.46 # Propositional solver time : 0.000 0.14/0.46 # Success case prop preproc time : 0.000 0.14/0.46 # Success case prop encoding time : 0.000 0.14/0.46 # Success case prop solver time : 0.000 0.14/0.46 # Current number of processed clauses : 10 0.14/0.46 # Positive orientable unit clauses : 4 0.14/0.46 # Positive unorientable unit clauses: 0 0.14/0.46 # Negative unit clauses : 4 0.14/0.46 # Non-unit-clauses : 2 0.14/0.46 # Current number of unprocessed clauses: 86 0.14/0.46 # ...number of literals in the above : 252 0.14/0.46 # Current number of archived formulas : 0 0.14/0.46 # Current number of archived clauses : 95 0.14/0.46 # Clause-clause subsumption calls (NU) : 681 0.14/0.46 # Rec. Clause-clause subsumption calls : 228 0.14/0.46 # Non-unit clause-clause subsumptions : 4 0.14/0.46 # Unit Clause-clause subsumption calls : 8 0.14/0.46 # Rewrite failures with RHS unbound : 0 0.14/0.46 # BW rewrite match attempts : 1 0.14/0.46 # BW rewrite match successes : 0 0.14/0.46 # Condensation attempts : 114 0.14/0.46 # Condensation successes : 0 0.14/0.46 # Termbank termtop insertions : 14739 0.14/0.46 # Search garbage collected termcells : 4401 0.14/0.46 0.14/0.46 # ------------------------------------------------- 0.14/0.46 # User time : 0.018 s 0.14/0.46 # System time : 0.004 s 0.14/0.46 # Total time : 0.022 s 0.14/0.46 # Maximum resident set size: 2984 pages 0.14/0.46 0.14/0.46 # ------------------------------------------------- 0.14/0.46 # User time : 0.027 s 0.14/0.46 # System time : 0.004 s 0.14/0.46 # Total time : 0.031 s 0.14/0.46 # Maximum resident set size: 2144 pages 0.14/0.46 % E exiting 0.14/0.46 % E exiting 0.14/0.46 EOF